Type Reconstruction for Syntactic Control of Interference, Part 2

Syntactic Control of Interference (SCI) 17] has long been studied as a basis for interference-free programming , with cleaner reasoning properties and semantics than traditional imperative languages. This paper improves upon Huang and Reddy's type inference system 7] for SCI-based languages in two signiicant ways. First, we eliminate the need for explicit coercion operators in terms. Second, we consider adding let-bound polymorphism, which appears to be nontrivial in the presence of interference control. SCI can be adapted to a wide variety of languages, and our techniques should be applicable to any such language with SCI-based interference control.